Subdivision Surface Simplification
نویسندگان
چکیده
A modified quadric error metric (QEM) for simplification of Loop subdivision surfaces is presented. The suggested error metric not only measures the geometric difference but also controls the smoothness and well-shapedness of the triangles that result from the decimation process. Minimizing the error with respect to the original limit surface, our method allows for drastic simplification of Loop control meshes with convenient control over the reproduction of sharp features.
منابع مشابه
Stable Cloth Animation with Adaptive Level of Detail
Cloth simulation is a highly intensive processor task. Higher details are often traded or sacrificed for speed in order to maintain the simulation at reasonable rates. This article proposes a technique to dynamically adjust the level of detail of cloth meshes. Mesh quality, during successive subdivision/simplification operations, is guaranteed by the subdivision scheme adopted. Also, topology o...
متن کاملA New Approach to Subdivision Simplification"
The line simplification problem is an old and well-studied problem in car tography. Although there are several efficient algorithms to compute a simpli fication within a specified error bound, there seem to be no algorithms that perform line simplification in the context of other geographical objects. Given a polygonal line and a set of extra points, we present a nearly quadratic time algorithm...
متن کاملMeshToSS: Converting Subdivision Surfaces from Dense Meshes
The theoretical aspects are discussed of our developed software, MeshToSS, for the conversion to Loop subdivision surfaces of dense triangular meshes. This software generates subdivision surfaces that approximate to their original mesh. The output is either a control mesh or its subdivided mesh applied to the Loop subdivision scheme. Our simple approach for the conversion is based on a well-kno...
متن کاملReverse Subdivision for Optimizing Visibility Tests
Certain applications require knowledge of whether two entities are visible to each other over a terrain, determined using a line-of-sight computation. Several fast algorithms exist for terrain line-of-sight computations. However, performing numerous line-of-sight computations, particularly over a large terrain data set, can be highly resource-intensive (in run time and/or memory). Methods from ...
متن کاملUnstructured Computational Meshes for Subdivision Geometry of Scanned Geological Objects
This paper presents a generic approach to generation of surface and volume unstructured meshes for complex free-form objects, obtained by laser scanning. A four-stage automated procedure is proposed for discrete data sets: surface mesh extraction from Delaunay tetrahedrization of scanned points, surface mesh simplification, definition of triangular interpolating subdivision faces, Delaunay volu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002